An Infeasible Primal-dual Algorithm for Tv-based Inf-convolution-type Image Restoration

نویسندگان

  • M. HINTERMÜLLER
  • G. STADLER
چکیده

In this paper, a primal-dual algorithm for TV-type image restoration is analyzed and tested. Analytically it turns out that employing a global L-regularization, with s > 1, in the dual problem results in a local smoothing of the TV-regularization term in the primal problem. The local smoothing can alternatively be obtained as the infimal convolution of the `r-norm, with r−1 + s−1 = 1, and a smooth function. In the case r = s = 2, this results in Gauss-TV-type image restoration. The globalized primal-dual algorithm introduced in this paper works with generalized derivatives, converges locally at a superlinear rate and is stable with respect to noise in the data. In addition, it utilizes a projection technique which reduces the size of the linear system that has to be solved per iteration. A comprehensive numerical study ends the paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Infeasible Primal-Dual Algorithm for Total Bounded Variation-Based Inf-Convolution-Type Image Restoration

In this paper, a primal-dual algorithm for total bounded variation (TV)–type image restoration is analyzed and tested. Analytically it turns out that employing a global Lregularization, with 1 < s ≤ 2, in the dual problem results in a local smoothing of the TVregularization term in the primal problem. The local smoothing can alternatively be obtained as the infimal convolution of the r-norm, wi...

متن کامل

An Efficient Primal-Dual Hybrid Gradient Algorithm For Total Variation Image Restoration

We propose a simple yet efficient algorithm for total variation (TV) minimizations with applications in the image processing realm. This descent-type algorithm alternates between the primal and dual formulations and exploit the information from both the primal and dual variables. It converges significantly faster than some popular existing methods as demonstrated in our experiments. This approa...

متن کامل

Convergence analysis of primal-dual algorithms for total variation image restoration

Recently, some attractive primal-dual algorithms have been proposed for solving a saddle-point problem, with particular applications in the area of total variation (TV) image restoration. This paper focuses on the convergence analysis of existing primal-dual algorithms and shows that the involved parameters of those primal-dual algorithms (including the step sizes) can be significantly enlarged...

متن کامل

Efficient Dual Algorithms for Image Segmentation Using TV-Allen-Cahn Type Models

Variational image segmentation based on theMumford and Shahmodel [31], together with implementation by the piecewise constant level-setmethod (PCLSM) [26], leads to fully nonlinear Total Variation (TV)-Allen-Cahn equations. The commonlyused numerical approaches usually suffer from the difficulties not only with the nondifferentiability of the TV-term, but alsowith directly evolving the disconti...

متن کامل

A General Framework for a Class of First Order Primal-dual Algorithms for Tv Minimization

We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008], draw connections to similar methods and discuss convergence of several special cases and modifications. In particular, we point out a convergence result fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004